Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
نویسندگان
چکیده
A deterministic finite automaton in which every non-empty set of states occurs as the image whole state under action a suitable input word is called completely reachable. We characterize such automata terms graphs and trees.
منابع مشابه
Completely Reachable Automata
We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
متن کاملSimulations Between Cellular Automata on Cayley Graphs
We consider cellular automata on Cayley graphs and compare their computational powers according to the architecture on which t h e y work. We show that, if there exists a homomorphism with a nite kernel from a group into another one such that the image of the rst group has a nite index in the second one, then every cellular automaton on the Cayley graph of one of these groups can be uni-formall...
متن کاملAutomata on Inifinite Trees
This article presents the basic theory of automata on infinite trees. We introduce the standard model of nondeterministic automata and the generalization to alternating automata. The central part of the theory considers the closure properties of tree languages definable by such automata, the equivalence of the different models, and their algorithmic properties. We show how these results are obt...
متن کاملPrefix codes, trees and automata
We inv~stigate-the relations be'·"'h.",pn the tree representation of a prefix code C, its patterns, the minimal automaton ~ * whi.ch recognizes C and the homomorphic images of the underlying algebra of ::G'. These relations provide us with an appealing formulation which allows us to state (and eventually solve) some problems concerning the structure of prefix codes and therefore the structure o...
متن کاملAdditive Automata On Graphs
A bstract. We study cellular automata. with addi tive rules on finite undi rected graphs. The addition is carried out in some finite abelian mono id. We investigate the prob lem of deciding wheth er a given configuration has a predecessor . Depending on th e underlying monoid this prob lem is solvable in polynomial time or NP-complete. Furt hermo re, we st udy the global reversibility of cellul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2023
ISSN: ['1793-6373', '0129-0541']
DOI: https://doi.org/10.1142/s0129054123450053